Infinite Domain Constraint Satisfaction Problem
نویسنده
چکیده
The computational and descriptive complexity of finite domain fixed template constraint satisfaction problem (CSP) is a well developed topic that combines several areas in mathematics and computer science. Allowing the domain to be infinite provides a way larger playground which covers many more computational problems and requires further mathematical tools. I will talk about some of the research challenges and recent progress on them. 1998 ACM Subject Classification F.2.2 Nonnumerical Algorithms and Problems/Complexity of proof procedures, F.4.1 Mathematical Logic/Logic and constraint programming
منابع مشابه
Collapsibility in Infinite-Domain Quantified Constraint Satisfaction
In this article, we study the quantified constraint satisfaction problem (QCSP) over infinite domains. We develop a technique called collapsibility that allows one to give strong complexity upper bounds on the QCSP. This technique makes use of both logical and universalalgebraic ideas. We give applications illustrating the use of our technique.
متن کاملMaximal Infinite-Valued Constraint Languages
We systematically investigate the computational complexity of constraint satisfaction problems for constraint languages over an infinite domain. In particular, we study a generalization of the well-established notion of maximal constraint languages from finite to infinite domains. If the constraint language can be defined with an ω-categorical structure, then maximal constraint languages are in...
متن کاملNon-dichotomies in Constraint Satisfaction Complexity
We show that every computational decision problem is polynomialtime equivalent to a constraint satisfaction problem (CSP) with an infinite template. We also construct for every decision problem L an ω-categorical template Γ such that L reduces to CSP(Γ ) and CSP(Γ ) is in coNP (i.e., the class coNP with an oracle for L). CSPs with ω-categorical templates are of special interest, because the uni...
متن کاملConstraint Satisfaction Problems with Infinite Templates
Allowing templates with infinite domains greatly expands the range of problems that can be formulated as a non-uniform constraint satisfaction problem. It turns out that many CSPs over infinite templates can be formulated with templates that are ω-categorical. We survey examples of such problems in temporal and spatial reasoning, infinite-dimensional algebra, acyclic colorings in graph theory, ...
متن کاملThe complexity of recursive constraint satisfaction problems
We investigate the complexity of finding solutions to infinite recursive constraint satisfaction problems. We show that, in general, the problem of finding a solution to an infinite recursive constraint satisfaction problem is equivalent to the problem of finding an infinite path through a recursive tree. We also identify natural classes of infinite recursive constraint problems where the probl...
متن کامل